Coloring quasi-line graphs
نویسندگان
چکیده
A graph G is a quasi-line graph if for every vertex v, the set of neighbors of v can be expressed as the union of two cliques. The class of quasi-line graphs is a proper superset of the class of line graphs. A theorem of Shannon’s implies that if G is a line graph then it can be properly colored using no more than 32ω(G) colors, where ω(G) is the size of the largest clique in G. In this paper we extend this result to all quasi-line graphs. We also show that this bound is tight.
منابع مشابه
Asymptotics of the chromatic number for quasi-line graphs
As proved by Kahn, the chromatic number and fractional chromatic number of a line graph agree asymptotically. That is, for any line graph G we have χ(G) ≤ (1 + o(1))χf (G). We extend this result to quasi-line graphs, an important subclass of claw-free graphs. Furthermore we prove that we can construct a colouring that achieves this bound in polynomial time, giving us an asymptotic approximation...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملOn-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations
The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs with geometric representations and competitive analysis of on-line algorithms, which became apparent after the recent construction of triangle-free geometric intersection graphs with arbitrarily large chromatic number due to Pawlik et al. We show that on-line graph coloring problems give ...
متن کاملOn quas-monotonous graphs
A dominating coloring by k colors is a proper k coloring where every color i has a representative vertex xi adjacent to at least one vertex in each of the other classes. The b-chromatic number, b(G), of a graph G is the largest integer k such that G admits a dominating coloring by k colors. A graph G = (V,E) is said b-monotonous if b(H1) ≥ b(H2) for every induced subgraph H1 of G and every subg...
متن کاملList-Coloring Claw-Free Graphs with Δ-1 Colors
We prove that if G is a quasi-line graph with ∆(G) > ω(G) and ∆(G) ≥ 69, then χOL(G) ≤ ∆(G) − 1. Together with our previous work, this implies that if G is a claw-free graph with ∆(G) > ω(G) and ∆(G) ≥ 69, then χl(G) ≤ ∆(G)− 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 54 شماره
صفحات -
تاریخ انتشار 2007